Matroid Secretaries
نویسندگان
چکیده
We prove that for every proper minor-closed class M of Fp-representable matroids, there exists a O(1)-competitive algorithm for the matroid secretary problem on M. This result relies on the extremely powerful matroid minor structure theory being developed by Geelen, Gerards and Whittle. We also note that for asymptotically almost all matroids, the matroid secretary algorithm that selects a random basis, ignoring weights, is (2 + o(1))-competitive. In fact, assuming the conjecture that almost all matroids are paving, there is a (1+o(1))competitive algorithm for almost all matroids.
منابع مشابه
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
The most important open conjecture in the context of the matroid secretary problem claims the existence of an O(1)-competitive algorithm applicable to any matroid. Whereas this conjecture remains open, modified forms of it have been shown to be true, when assuming that the assignment of weights to the secretaries is not adversarial but uniformly at random [23, 20]. However, so far, no variant o...
متن کاملThe secretary returns
In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the al...
متن کاملThe Returning Secretary
In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the al...
متن کاملSecretary problems: weights and discounts
The classical secretary problem studies the problem of selecting online an element (a “secretary”) with maximum value in a randomly ordered sequence. The difficulty lies in the fact that an element must be either selected or discarded upon its arrival, and this decision is irrevocable. Constant-competitive algorithms are known for the classical secretary problems (see, e.g., the survey of Freem...
متن کاملThe Clinical Work of Secretaries: Exploring the Intersection of Administrative and Clinical Work in the Diagnosing Process
Diagnostic work is often defined by the skill of clinicians whereas the contributions of non-clinicians, for example secretaries, tend to fade into the background. The secretaries are deeply involved in diagnostic work through the eligible administration of patients in the collaborative electronic information systems. This study explores the secretaries’ role in diagnostic work, focusing specif...
متن کامل